| 1. | A novel algorithm and its convergence for a class of combinatorial optimization problems
一类组合优化问题的新解法及其收敛性 |
| 2. | This paper studies the approximation algorithms of some combinatorial optimization problems
本文主要研究组合优化中若干问题的近似算法。 |
| 3. | In addition , simulated annealing algorithm for the combinatorial optimization problem here is also given
此外，利用模拟退火算法成功地解决了该组合优化问题。 |
| 4. | Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
布局问题是具有np完备计算复杂度的离散组合优化问题。 |
| 5. | Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm
成组技术问题是组合优化问题,而遗传算法正是目前求解组合最优化的有效方法之一。 |
| 6. | The cast grouping and ordering problem of steelmaking continuous casting hot rolling ( sm - cc ) is a combinatorial optimization problem
摘要炼钢-连铸生产的浇次组合与排序是带有工艺约束的并行机流水车间调度问题。 |
| 7. | The optimization of gear parameters in designing movements of clocks and watches is a combinatorial optimization problem . it is difficult to solve the problem
钟手表机芯设计中齿轮参数的优化设计问题是一个组合优化问题,很难用传统优化方法解决。 |
| 8. | Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs
排序问题研究的是若干个任务要在一些机器上进行加工，如何安排机器和任务使得某些要求(目标函数)达到最优的问题。 |
| 9. | Recently , genetic algorithm has been tyied to resolve variable combinatorial optimization problems , such as job scheduling problem , but but has began just now in vsp
近些年来，人们在用遗传算法解决现实中的各种组合优化问题上进行了探索，如在生产调度问题中的应用，但在车辆调度问题中的应用才刚刚开始。 |
| 10. | In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems
在第二章至第五章中，我们分别研究了四个组合优化问题的近似算法，并给出了它们的性能分析。 |
